منابع مشابه
THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملConvex ordering criteria for Lévy processes
Modelling financial and insurance time series with Lévy processes or with exponential Lévy processes is a relevant actual practice and an active area of research. It allows qualitatively and quantitatively good adaptation to the empirical statistical properties of asset returns. Due to model incompleteness it is a problem of considerable interest to determine the dependence of option prices in ...
متن کاملAn Ordering of Convex Topological Relations
Topological relativity is a concept of interest in geographic information theory. One way of assessing the importance of topology in spatial reasoning is to analyze commonplace terms from natural language relative to conceptual neighborhood graphs, the alignment structures of choice for topological relations. Sixteen English-language spatial prepositions for regionregion relations were analyzed...
متن کاملCo-ordering and Type 2 co-ordering
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational numbers. One of the main questions there, was:"For a specific c.e. set A, consider set of all enumerations of it which is generated by some Turing machine {...
متن کاملOrdering of convex polyhedra and the Fedorov algorithm.
A method of naming any convex polyhedron by a numerical code arising from the adjacency matrix of its edge graph has been previously suggested. A polyhedron can be built using its name. Classes of convex n-acra (i.e. n-vertex polyhedra) are strictly (without overlapping) ordered by their names. In this paper the relationship between the Fedorov algorithm to generate the whole combinatorial vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications, Faculty Of Science, University of Ankara Series A1Mathematics and Statistics
سال: 2005
ISSN: 1303-5991
DOI: 10.1501/commua1_0000000328